Typing Graph-Manipulation Operations
نویسنده
چکیده
We present a graph-based data model called GDM where database instances and database schemas are described by certain types of labeled graphs called instance graphs and schema graphs. For this data model we introduce two graph-manipulation operations, an addition and a deletion, that are based on pattern matching and can be represented in a graphical way. For these operations it is investigated if they can be typed such that it is guaranteed for well-typed operations that the result belongs to a certain database schema graph, and what the complexity of deciding this well-typedness is.
منابع مشابه
Dependently-Typed Formalisation of Typed Term Graphs
The Coconut project [AK09a, AK09b] uses “code graphs” [KAC06], a variant of term graphs in the spirit of “jungles” [HP91, CR93], as intermediate presentation for the generation of highly optimised assembly code. This is currently implemented in Haskell, and we use the Haskell type system in an embedded domain-specific language (EDSL) for creating such code graphs via what appears to be standard...
متن کاملEffect of Peer Performance, Future Competitive Performance, and Factors of Correlation with Peer Companies on Manipulation of Abnormal Real Operations
This study aimed to evaluate the effect of peer performance, future competitive performance and factors of correlation with peer companies on the manipulation of abnormal real operations. The research subjects included listed companies in Tehran Stock Exchange during 2013-2017. In total, 128 companies were selected as the statistical sample using systematic elimination approach. Peer performanc...
متن کاملSome New Results On the Hosoya Polynomial of Graph Operations
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...
متن کاملCharacteristics of Common Neighborhood Graph under Graph Operations and on Cayley Graphs
Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...
متن کاملApplications of some Graph Operations in Computing some Invariants of Chemical Graphs
In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.
متن کامل